行波型热声发动机的分布参数法热力分析

在现有热声网络模型的基础上 ,对行波型热声发动机采用分布参数法进行了详细地分析 ,得到了较为完整的分布参数法网络模型 ,并给出了该模型的定性关系式 ,所得结果与采用集总参数法的结果有很大差异。分析表明 ,分布参数法更适合于一般的系统情况 ,集总参数法仅仅在一定条件下才适用。文中对一个实际系统应用分布参数法进行了分析 ,得到一些结论 ,对于我们设计行波型热声发动机有非常重要的理论指导意义     

Using activity focus networks to pressure terrorist organizations

The predominant idea for using network concepts to fight terrorists centers on disabling key parts of their communication networks. Although this counternetwork strategy is clearly a sound approach, it is vulnerable to missing, incomplete, or erroneous information about the network. This paper describes a different and complementary application of network concepts to terrorist organizations. It is based on activity focus networks (AFNs), which represent the complex activity system of an organization. An activity focus is a conceptual or physical entity around which joint activity is organized. Any organization has a number of these, which are in some cases compatible and in some cases incompatible. The set of foci and their relations of compatibility and incompatibility define the AFN. A hypothetical AFN for a terrorist organization is specified and tested in a simulation called AQAS. It shows that certain activity foci, and in particular one combination, have high potential as pressure points for the activity system. The AFN approach complements the counternetwork approach by reducing the downside risk of incomplete information about the communication network, and enhancing the effectiveness of counternetwork approaches over time. Steven R. Corman is Professor in the Hugh Downs School of Human Communication at Arizona State University and Chair of the Organizational Communication Division of the International Communication Association. His research interests include communication networks and activity systems, high-resolution text and discourse analysis, and modeling and simulation of human communication systems.     

Network externalities in a dynamic monopoly

We reconsider the role of network externalities in a dynamic spatial monopoly where the firm must invest in order to accumulate capacity, while consumers may have either linear or quadratic preferences. We (1) characterise saddle point equilibria, (2) prove that the extent of market coverage is increasing in the network effect and (3) unlike the existing static literature on the same problem, the monopolist may not make introductory price offers. Then, we briefly deal with the socially optimal solution, showing that, in general, a planner would serve more consumers than a profit-seeking monopolist.      

关于组合最优化理论的多媒体教学实践

本文讨论和分析了开发组合最比化理论系列课程多媒体课件的基本认识、课件的主要特色和体会，并提出了使用多媒体课件中应注意的问题．     

Survivable network design under optimal and heuristic interdiction scenarios

We examine the problem of building or fortifying a network to defend against enemy attacks in various scenarios. In particular, we examine the case in which an enemy can destroy any portion of any arc that a designer constructs on the network, subject to some interdiction budget. This problem takes the form of a three-level, two-player game, in which the designer acts first to construct a network and transmit an initial set of flows through the network. The enemy acts next to destroy a set of constructed arcs in the designer’s network, and the designer acts last to transmit a final set of flows in the network. Most studies of this nature assume that the enemy will act optimally; however, in real-world scenarios one cannot necessarily assume rationality on the part of the enemy. Hence, we prescribe optimal network design algorithms for three different profiles of enemy action: an enemy destroying arcs based on capacities, based on initial flows, or acting optimally to minimize our maximum profits obtained from transmitting flows.     

A characterization of network representable polymatroids

Meggido [1974] showed that the maximum flow through sets of sources in a multiple sink flow network is a polymatroidal function. Recently, Federgruen and Groenevelt [1985], [1986] have considered polymatroids that can be represented by a multiple source flow network and have improved the runnung time of an important scheduling application.We give a characterization of network representability and relate representable polymatroids to the theory of gammoids.

---

Zusammenfassung Meggido [1974] hat gezeigt, daß ein maximaler Fluß durch ein Netzwerk mit mehrfachen Senken eine polymatroidale Funktion beschreibt. Federgruen und Groenvelt [1985], [1986] haben kürzlich solche Polymatroide betrachtet, die durch Flüsse in derartigen Netzwerken repräsentiert werden können und haben so die Laufzeit einer wichtigen Schedulinganwendung verbessern können.Wir geben eine Charakterisierung von Funktionen, die durch derartige Netzflußnetzwerke realisierbar sind. Dabei stellen wir eine Verbindung her zwischen Repräsentierbarkeit und Gammoidtheorie.

     

基于支持向量机的肤色滤波器

为了探测图像中的肤色像素，提出了一种新的方法-支持向量机（SVM：Support Vector Machine）方法.它是一种基于肤色的非特定人的面部定位方法，是非接触人机交互技术和机器视觉中的一个重要内容.实验结果表明，采用支持向量机方法较传统人工神经网络方法不仅有更高的探测准确性，而且具有更好的推广性能.由于SVM采用结构风险最小化（SRM：Structural Risk Minimization）准则，在最小化训练误差（经验风险）的同时，尽量缩小模型预测误差的上界，从而使模型有更好的泛化能力.     

12-Ring Network Coordination Polymer——{[Cu(C_4N_2H_(10))_4]_2·H_4V_4O_(14)}_n Formed by Linking cyclo-[H_4V_4O_(14)]~(4-) with Cu(C_4N_2H_(10))~(2+)_4 Cation Clusters

IntroductionThe interest in polyoxometalates that are widelyused in medical chemistry, catalyst reactions, and ma-terial sciences stems from their complicated aggregatesformed by means of corner-, edge- and face-sha-ring[1—4]. The exploitation of new str…     

SPAR: stochastic programming with adversarial recourse

We consider a general adversarial stochastic optimization model. Our model involves the design of a system that an adversary may subsequently attempt to destroy or degrade. We introduce SPAR, which utilizes mixed-integer programming for the design decision and a Markov decision process (MDP) for the modeling of our adversarial phase.